Individually rational, budget-balanced mechanisms and allocation of surplus

نویسندگان

  • Grigory Kosenok
  • Sergei Severinov
چکیده

We investigate the issue of implementation via individually rational ex-post budget-balanced Bayesian mechanisms. We show that all decision rules generating a nonnegative expected social surplus are implementable via such mechanisms if and only if the probability distribution of the agents’ type profiles satisfies two conditions: the well-known condition of Crémer and McLean [1988. Full extraction of the surplus in Bayesian and dominant strategy auctions, Econometrica 56, 1247–1257] and the Identifiability condition introduced in this paper. We also show that these conditions are necessary for ex-post efficiency to be attainable with budget balance and individual rationality, and that the expected social surplus in these mechanisms can be distributed in any desirable way. Lastly, we demonstrate that, like Crémer–McLean condition, the Identifiability condition is generic if there are at least three agents. © 2007 Elsevier Inc. All rights reserved. JEL classification: C72; D82

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Trading Mechanisms with Budget Surplus and Partial Trade

In a bilateral bargaining problem with private values, Hagerty and Rogerson (1987) showed that essentially all dominant strategy incentive compatible, ex post individually rational, and budget balanced mechanisms are posted-price mechanisms, where a price is drawn from a distribution, and trade occurs if both players benefit from trading at this price. We relax budget balancedness to feasibilit...

متن کامل

Individually Rational, Balanced-Budget Bayesian Mechanisms and the Informed Principal Problem

We investigate the issue of implementation via individually rational ex-post budgetbalanced Bayesian mechanisms. We show that all decision rules generating a nonnegative expected social surplus are implementable if and only if the probability distribution of the agents’ types satisfies two conditions: the well-known condition of Crémer and McLean (1985) and the Identifiability condition introdu...

متن کامل

Optimal VCG Mechanisms to Assign Multiple Tasks∗

We develop optimal VCG mechanisms in order to assign identical economic “bads” (for example, costly tasks) to agents. The optimal non-deficit VCG mechanism achieves asymptotic budget balance, yet the non-deficit requirement is incompatible with reasonable welfare bounds. If we omit the non-deficit requirement, individual rationality greatly changes the relationship between burning a budget surp...

متن کامل

A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms

Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...

متن کامل

House Allocation with Transfers

We consider the Shapley-Scarf house allocation problem where monetary transfers are allowed. We characterize the class of mechanisms that are strategy-proof, ex post individually rational, ex post budget balanced, and “collusion-proof.” In these mechanisms, the price of each object is fixed in advance, and the objects are reallocated according to the (unique) core assignment of the Shapley-Scar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Economic Theory

دوره 140  شماره 

صفحات  -

تاریخ انتشار 2008